- alternating path
- мат.чередующаяся цепь (графа)
English-Russian scientific dictionary. 2008.
alternating path
Смотреть что такое "alternating path" в других словарях:
Alternating current — (green curve). The horizontal axis measures time; the vertical, current or voltage. In alternating current (AC, also ac) the movement of electric charge periodically reverses direction. In direct current (DC, also dc), the flow of electric charge … Wikipedia
Path 64 — or the Marketplace Adelanto line is a very long 202 mile (325 km) 500 kilovolt power line that runs from the Adelanto substation close to Adelanto, California and the High Desert all the way to the Marketplace substation in Nevada.[1][2]… … Wikipedia
Alternating finite automaton — In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal transitions. For example, let A be an alternating automaton.* For an existential… … Wikipedia
Induced path — An induced path of length four in a cube. Finding the longest induced path in a hypercube is known as the snake in the box problem. In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced… … Wikipedia
Devil's Path (hiking trail) — Devil s Path A backpacker negotiates a rock chimney on Indian Head Mountain Length 24.2 miles (39km) Location Town of Hunter / Town of Lexington, Greene County, New York, U … Wikipedia
Littelmann path model — In mathematics, the Littelmann path model is a combinatorial device due to Peter Littelmann for computing multiplicities without overcounting in the representation theory of symmetrisable Kac Moody algebras. Its most important application is to… … Wikipedia
Skew-symmetric graph — In graph theory, a branch of mathematics, a skew symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by reversing all of its edges. The isomorphism is required to be an involution without any fixed… … Wikipedia
König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
